Practical Proven Secure Authentication with Arbitration

Proven secure signature schemes and unconditionally secure authentication schemes with arbiter have been proposed. The former are not practical (too slow) and the latter cannot be reused. All these limitations are solved in this paper by presenting a resuable conditionally secure authentication scheme with arbiter. The scheme is unconditionally secure against denial by the sender of having sent a message (which signatures do not have) and conditionally secure against a receiver impersonating the sender or substituting a message and conditionally secure against a similar fraud by the arbiter. Disciplines Physical Sciences and Mathematics Publication Details Yvo Desmedt and Jennifer Seberry, Practical proven secure authentication with arbitration, ( Jennifer Seberry and Yuliang Zheng, (Eds.)) Advances in Cryptography Auscrypt'92, Conference held at the Gold Coast, Australia, December 1992, 718, Lecture Notes in Computer Science, Springer-Verlag, Berlin--Heidelberg-New York, (1993), 27-32. This conference paper is available at Research Online: http://ro.uow.edu.au/infopapers/1081 Practical Proven Secure Authentication with Arbitration Yvo Desmedt1* ** and Jennifer Seberry2*** t 1 EE &. CS Department, University of WisconsinMilwaukee, WI 53201, U.S.A. 2 Department of Computer Science, The University of Wollongong Wollongong, NSW, 2522, Australia Abstract. Proven secure signature schemes and unconditionally secure authentication schemes with arbiter have been proposed. The former are not practical (too slow) and the latter cannot be reused. All these limitations are solved in this paper by presenting a resuable conditionally secure authentication scheme with arbiter. The scheme is unconditionally secure against denial by the sender of having sent a message (which signatures do not have) and conditionally secure against a receiver impersonating the sender or substituting a message and conditionally secure against a similar fraud by the arbiter. Proven secure signature schemes and unconditionally secure authentication schemes with arbiter have been proposed. The former are not practical (too slow) and the latter cannot be reused. All these limitations are solved in this paper by presenting a resuable conditionally secure authentication scheme with arbiter. The scheme is unconditionally secure against denial by the sender of having sent a message (which signatures do not have) and conditionally secure against a receiver impersonating the sender or substituting a message and conditionally secure against a similar fraud by the arbiter.